Solving 8×8 Domineering

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Perfectly Solving Domineering Boards

In this paper we describe the perfect solving of rectangular empty Domineering boards. Perfect solving is defined as solving without any search. This is done solely based on the number of various move types in the initial position. For this purpose we first characterize several such move types. Next we define 12 knowledge rules, of increasing complexity. Of these rules, 6 can be used to show th...

متن کامل

Standard Domineering

Cincotti and Iida invented the game of of Synchronized Domineering, and analyzed a few special cases. We developed a more general technique of analysis, and obtained results for many more special cases. This article lists application of our analysis to obtain results for standard two player Domineering Introduction In Synchronized Domineering, exist four possible outcomes:

متن کامل

New Temperatures in Domineering

Games of No Chance [8] presents a table of known Domineering temperatures, including approximately 40 with denominator less than or equal to 512, and poses the challenge of finding new temperatures. We present 219 Domineering positions with distinct temperatures not shown in GONC – including 26 with temperature greater than 3/2 – obtained through exhaustive computational search of several Domin...

متن کامل

An update on domineering on rectangular boards

Domineering is a combinatorial game played on a subset of a rectangular grid between two players. Each board position can be put into one of four outcome classes based on who the winner will be if both players play optimally. In this note, we review previous work, establish the outcome classes for several dimensions of rectangular board, and restrict the outcome class in several more.

متن کامل

Who Wins Domineering on Rectangular Boards?

Using mostly elementary considerations, we find out who wins the game of Domineering on all rectangular boards of width 2, 3, 5, and 7. We obtain bounds on other boards as well, and prove the existence of polynomial-time strategies for playing on all boards of width 2, 3, 4, 5, 7, 9, and 11. We also comment briefly on toroidal and cylindrical boards.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2000

ISSN: 0304-3975

DOI: 10.1016/s0304-3975(99)00082-1